TERMINAL CONTROL, TIME LAGS, AND DYNAMIC PROGRAMMING
نویسندگان
چکیده
منابع مشابه
Evolutionary learning of dynamic probabilistic models with large time lags
In this paper, we explore the automatic explanation of Multivariate Time Series (MTS) through learning Dynamic Bayesian Networks (DBNs). We have developed an evolutionary algorithm which exploits certain characteristics of process MTS in order to generate good networks as quickly as possible. We compare this algorithm to other standard learning algorithms that have traditionally been used for s...
متن کاملDynamic Programming, Control, and Computation∗
The presentation in this chapter is in the formal manner of classical applied mathematics and probability in order to focus on the methods and their implementation. In Section 1, a fairly general model of stochastic dynamic programming in continuous time is outlined. In Section 2, canonical forms, such as a linear dynamics and quadratic cost model in control, that lead to a large reduction in c...
متن کاملTime Varying Terminal Control
Two recent contributions to the literature (Kouvaritakis et al., 2000; Imsland et al., 2004) have shown how to use offline analysis to reduce online computation while enlarging the feasible regions of a control law. Both methods make use of an augmented system so this paper gives some proper discussion of their differences and similarities and in particular it gives new insight to the structure...
متن کاملDiscrete time McKean-Vlasov control problem: a dynamic programming approach
We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate l...
متن کاملReal-Time Symbolic Dynamic Programming
Recent advances in Symbolic Dynamic Programming (SDP) combined with the extended algebraic decision diagram (XADD) have provided exact solutions for expressive subclasses of finite-horizon Hybrid Markov Decision Processes (HMDPs) with mixed continuous and discrete state and action parameters. Unfortunately, SDP suffers from two major drawbacks: (1) it solves for all states and can be intractabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1957
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.43.10.927